Homotopic Distance and Generalized Motion Planning

نویسندگان

چکیده

Abstract We prove that the homotopic distance between two maps defined on a manifold is bounded above by sum of their subspace distances critical submanifolds any Morse–Bott function. This generalizes Lusternik–Schnirelmann theorem (for Morse functions) and similar result Farber for topological complexity. Analogously, we that, analytic manifolds, submanifold its cut locus. As an application, show how navigation functions can be used to solve generalized motion planning problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homotopic particle motion planning for humanoid robotics

Exploiting structure is essential to an understanding of motion planning. Here, we exploit the topology of the environment to discover connected components. Inside a connected component, instead of planning one trajectory in configuration space, motion planning can be seen as optimizing a set of homotopically equivalent particle trajectories. In this paper, we will concentrate on the problem of...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

mobile robot online motion planning using generalized voronoi graphs

in this paper, a new online robot motion planner is developed for systematically exploring unknown environâ¬ments by intelligent mobile robots in real-time applications. the algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. it does so by online calculation of the generalized voronoi graph (gvg) of the free space, and utilizing a combination of depth-first an...

متن کامل

Efficient Motion Planning using Generalized Penetration Depth Computation

Liangjun Zhang: Efficient Motion Planning using Generalized Penetration Depth Computation. (Under the direction of Dinesh Manocha.) Motion planning is a fundamental problem in robotics and also arises in other applications including virtual prototyping, navigation, animation and computational structural biology. It has been extensively studied for more than three decades, though most practical ...

متن کامل

A Generalized Label Correcting Method for Optimal Kinodynamic Motion Planning

A resolution complete optimal kinodynamic motion planning algorithm is presented and described as a generalized label correcting (GLC) method. In contrast to related algorithms, the GLC method does not require a local planning subroutine and benefits from a simple implementation. The key contributions of this paper are the construction and analysis of theGLC conditions which are the basis of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mediterranean Journal of Mathematics

سال: 2022

ISSN: ['1660-5454', '1660-5446']

DOI: https://doi.org/10.1007/s00009-022-02166-4